On a Transfer Theorem for the P 6= Np Conjecture
نویسنده
چکیده
A model of computation is defined over the algebraic numbers and over number fields. This model is non-uniform, and the cost of operations depends on the height of the operands and on the degree of the extension of the rational defined by those operands. A transfer theorem for the P 6 = NP Conjecture is proved, namely: P 6 = NP in this model over the real algebraic numbers if and only if P 6 = NP in the classical setting.
منابع مشابه
On some generalisations of Brown's conjecture
Let $P$ be a complex polynomial of the form $P(z)=zdisplaystyleprod_{k=1}^{n-1}(z-z_{k})$,where $|z_k|ge 1,1le kle n-1$ then $ P^prime(z)ne 0$. If $|z|
متن کاملOn Silverman's conjecture for a family of elliptic curves
Let $E$ be an elliptic curve over $Bbb{Q}$ with the given Weierstrass equation $ y^2=x^3+ax+b$. If $D$ is a squarefree integer, then let $E^{(D)}$ denote the $D$-quadratic twist of $E$ that is given by $E^{(D)}: y^2=x^3+aD^2x+bD^3$. Let $E^{(D)}(Bbb{Q})$ be the group of $Bbb{Q}$-rational points of $E^{(D)}$. It is conjectured by J. Silverman that there are infinitely many primes $p$ for which $...
متن کاملDecision P Systems and the P!=NP Conjecture
In this paper we present the model of decision P systems with external output and prove the following main result: if there exists an NP–complete problem that cannot be solved in polynomial time, with regard to the input length, by the deterministic variant of such P systems, constructed in polynomial time, then P 6= NP . From Zandron-FerretiMauri’s theorem it follows that if P 6= NP then no NP...
متن کاملMAT 585: Max-Cut and Stochastic Block Model
Today we discuss two NP-hard problems, Max-Cut and minimum bisection. As these problems are NP-hard, unless the widely believed P 6= NP conjecture is false, these problem cannot be solved in polynomial time for every instance. These leaves us with a couple of alternatives: either we look for algorithms that approximate the solution, or consider algorithms that work for “typical” instances, but ...
متن کامل